Boosted Decision Tree for Q-matrix Refinement
نویسندگان
چکیده
In recent years, substantial improvements were obtained in the effectiveness of data driven algorithms to validate the mapping of items to skills, or the Q-matrix. In the current study we use ensemble algorithms on top of existing Qmatrix refinement algorithms to improve their performance. We combine the boosting technique with a decision tree. The results show that the improvements from both the decision tree and Adaboost combined are better than the decision tree alone and yield substantial gains over the best performance of individual Q-matrix refinement algorithm.
منابع مشابه
Diagonal Matrix Reduction over Refinement Rings
Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement. Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N if and only if Mm ~Nm for all maximal ideal m of R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملCombining techniques to refine item to skills Q-matrices with a partition tree
The problem of mapping items to skills is gaining interest with the emergence of recent techniques that can use data for both defining this mapping, and for refining mappings given by experts. We investigate the problem of refining mapping from an expert by combining the output of different techniques. The combination is based on a partition tree that combines the suggested refinements of three...
متن کاملOptimization with Gradient-Boosted Trees and Risk Control
Decision trees effectively represent the sparse, high dimensional and noisy nature of chemical data from experiments. Having learned a function from this data, we may want to thereafter optimize the function, e.g., picking the best chemical process catalyst. In this way, we may repurpose legacy predictive models. This work studies a large-scale, industrially-relevant mixed-integer quadratic opt...
متن کاملA Partition Tree Approach to Combine Techniques to Refine Item to Skills Q-Matrices
The problem of mapping items to skills is gaining interest with the emergence of recent techniques that can use data for both defining this mapping, and for refining mappings given by experts. We investigate the problem of refining mapping from an expert by combining the output of different techniques. The combination is based on a partition tree that combines the suggested refinements of three...
متن کامل